package a.codetop.归并;

public class _13最短路径和 {
    public int minPathSum(int[][] grid) {
        int m=grid.length,n=grid[0].length;
        int[][] dp = new int[m][n];

        dp[0][0]=grid[0][0];
        //横
        for (int j = 1; j < n; j++) dp[0][j]=dp[0][j-1]+grid[0][j];
        //竖
        for (int i = 1; i < m; i++) dp[i][0]=dp[i-1][0]+grid[i][0];

        //横着走
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j]=grid[i][j]+Math.min(dp[i-1][j],dp[i][j-1]);
            }
        }

        return dp[dp.length-1][dp[0].length-1];
    }
}
